The time-dependent prize-collecting arc routing problem
نویسندگان
چکیده
منابع مشابه
The Clustered Prize-Collecting Arc Routing Problem
Prize-collecting Arc Routing Problems are arc routing problems where, in addition to the cost function, there is a profit function on the edges that must be taken into account only the first time that an edge is traversed. In this work we present the Clustered Prize-collecting Arc Routing Problem where there are clusters of arcs and, for each cluster, we require that either all its links are se...
متن کاملPrize-collecting Arc Routing Problems and Extensions
In this work we present the Prize-collecting Arc Routing Problem and some extensions. We derive properties that allow determining linear defining systems for the problems and solution approaches based on upper bounds obtained from relaxations reinforced with cuts, and lower bounds derived from heuristics. We also present numerical results from computational experiments that show that in many ca...
متن کاملThe Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem
In this paper, we introduce a multi vehicle version of the Time-Dependent PrizeCollecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real-life traffic situations where the travel times change with the time of day are taken into account. T...
متن کاملThe Windy Prize-Collecting Rural Postman Problem: An Ant-Colony Based Heuristic
The Prize-collecting Rural Postman Problem, also known as the Privatized Rural Postman Problem, is an arc-routing problem where each demand edge is associated with a profit, which is collected once if the edge is served, independently of the number of traversals. Included edges incur in routing costs proportionally to the number of traversals. In this paper, we introduce the Windy Privatized Ru...
متن کاملSolving the Prize-collecting Rural Postman Problem
In this work we present an algorithm for solving the Prize-collecting Rural Postman Problem. This problem was recently defined and is a generalization of other arc routing problems like, for instance, the Rural Postman Problem. The main difference is that there are no required edges. Instead, there is a profit function on the edges that must be taken into account only the first time that an edg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 40 شماره
صفحات -
تاریخ انتشار 2013